Harmonious Labelings Via Cosets and Subcosets
نویسندگان
چکیده
In [Abueida, A. and Roblee, K., More harmonious labelings of families disjoint unions an odd cycle certain trees, J. Combin. Math. Comput., 115 (2020), 61-68] it is shown that the union paths harmonious, starlike trees are using properties cosets for a particular subgroup integers modulo m, where m number edges graph. We expand upon these results by first exploring numerical when adding values from subcosets in m. will then show may be used to harmoniously label graphs involving more complex tree, which we call snowflake
منابع مشابه
On Harmonious Labelings of Some Cycle Related Graphs
A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G)→ {0, 1, 2, · · · , 2q − 1} such that the induced function f∗ : E(G) → {1, 3, · · · , 2q − 1} defined by f∗(uv) = f(u) + f(v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph. In this paper we prove that any two even cycles sharing a common vertex and a common edge are od...
متن کاملStraight-Line Triangle Representations via Schnyder Labelings
A straight-line triangle representation (SLTR) of a planar graph is a straight-line drawing such that all the faces including the outer face are triangles. Such a drawing can be viewed as a tiling of a triangle with triangles where the input graph is the skeletal structure. A characterization based on flat angle assignments, i.e., selections of angles of the graph that are of size π in the repr...
متن کاملCosets and genericity
In a connected group of finite Morley rank in which the generic element belongs to a connected nilpotent subgroup, proper normalizing cosets of definable subgroups are not generous. We explain why this is true and what consequences this has on an abstract theory of Weyl groups in groups of finite Morley rank. The only known infinite simple groups of finite Morley rank are the simple algebraic g...
متن کاملp-HARMONIOUS FUNCTIONS WITH DRIFT ON GRAPHS VIA GAMES
In a connected finite graph E with set of vertices X, choose a nonempty subset, not equal to the whole set, Y ⊂ X, and call it the boundary Y = ∂X. Given a real-valued function F : Y → R, our objective is to find a function u, such that u = F on Y , and for all x ∈ X \ Y , u(x) = α max y∈S(x) u(y) + β min y∈S(x) u(y) + γ “P y∈S(x) u(y) #(S(x)) ” . Here α, β, γ are non-negative constants such th...
متن کاملCosets and Lagrange’s Theorem
In other words, a coset is what we get when we take a subgroup and shift it (either on the left or on the right). The best way to think about cosets is that they are shifted subgroups, or translated subgroups. Note g lies in both gH and Hg, since g = ge = eg. Typically gH 6= Hg. When G is abelian, though, left and right cosets of a subgroup by a common element are the same thing. When an abelia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and applications of graphs
سال: 2022
ISSN: ['2470-9859']
DOI: https://doi.org/10.20429/tag.2022.090204